Improved Bounds in Stochastic Matching and Optimization
نویسندگان
چکیده
منابع مشابه
Improved bounds for stochastic matching
This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.
متن کاملImproved Bounds for Online Stochastic Matching
We study the online stochastic matching problem in a form motivated by Internet display advertisement. Recently, Feldman et al. gave an algorithm that achieves 0.6702 competitive ratio, thus breaking through the 1−1/e barrier. One of the questions left open in their work is to obtain a better competitive ratio by generalizing their two suggested matchings (TSM) algorithm to d-suggested matching...
متن کاملOnline Stochastic Matching: New Algorithms and Bounds
Online matching has received significant attention over the last 15 years due to its close connection to Internet advertising. As the seminal work of Karp, Vazirani, and Vazirani has an optimal (1 − 1/e) competitive ratio in the standard adversarial online model, much effort has gone into developing useful online models that incorporate some stochasticity in the arrival process. One such popula...
متن کاملSampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external parameter ω ∈ Ω given by a probability distribution π. The value of the objective function is a random variable and often the goal is to find an x ∈ X to minimize the expected cost Eω[fω(x)]. Each ω is referred to as a...
متن کاملImproved Bounds for Online Preemptive Matching
When designing a preemptive online algorithm for the maximum matching problem, we wish to maintain a valid matching M while edges of the underlying graph are presented one after the other. When presented with an edge e, the algorithm should decide whether to augment the matching M by adding e (in which case e may be removed later on) or to keep M in its current form without adding e (in which c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0383-4